package 力扣热题100;

public class LeetCode29 {
    public int climbStairs(int n) {
        int a=0;
        int b=1;
        int c=0;
        for (int i = 0; i < n; i++) {
            c=a+b;
            a=b;
            b=c;
        }
        return c;
    }
}
